Detecting tampering in a random hypercube
نویسندگان
چکیده
منابع مشابه
Detecting tampering in a random hypercube
Consider the random hypercube H 2 (pn) obtained from the hypercube H n 2 by deleting any given edge with probabilty 1− pn, independently of all the other edges. A diameter path in H 2 is a longest geodesic path in H n 2 . Consider the following two ways of tampering with the random graph H 2 (pn): (i) choose a diameter path at random and adjoin all of its edges to H 2 (pn); (ii) choose a diamet...
متن کاملDetecting Database File Tampering through Page Carving
Database Management Systems (DBMSes) secure data against regular users through defensive mechanisms such as access control, and against privileged users with detection mechanisms such as audit logging. Interestingly, these security mechanisms are built into the DBMS and are thus only useful for monitoring or stopping operations that are executed through the DBMS API. Any access that involves di...
متن کاملA Novel Approach for Detecting of Tampering On Images
In Our Society Digital Images Are Powerful And Widely Used In Communication Medium. They Have An Important Impact On Our Lives. In The Recent Years, Due To The Advent Of High Performance Commodity Hardware And Improved Human Computer Interfaces. It Has Become Relatively Easy To Create The Fake Images. In The Modern Days, It Is Easy To Use Image Forgeries That Are Undetectable By The Naked Eye. ...
متن کاملDetecting tampering in audio-visual content using QIM watermarking
This paper presents a framework for detecting tampered information in digital audio-visual content. The proposed framework uses a combination of temporal and spatial watermarks that do not decrease the quality of host videos. A modified version of the Quantization Index Modulation (QIM) algorithm is used to embed watermarks. The fragility of the QIM watermarking algorithm makes it possible to d...
متن کاملA note on random walks in a hypercube
We study a simple random walk on an n-dimensional hypercube. For any starting position we find the probability of hitting vertex a before hitting vertex b, whenever a and b share the same edge. This generalizes the model in [2] (see Exercise 1.3.7 there). Random walks, electric networks, hypercube 60G50, 60J45 Consider an n-dimensional hypercube, that is a graph with 2 vertices in the set {0, 1...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Probability
سال: 2013
ISSN: 1083-6489
DOI: 10.1214/ejp.v18-2290